Link Selection Schemes for Avoiding Channel Contention

نویسندگان

  • Fang Yu
  • Rakesh K. Sinha
  • Robert Doverspike
  • Bruce Cortez
  • John Strand
چکیده

This paper describes methods to reduce channel contention during distributed setup of high-speed connections in a mesh network of Cross-Connects (XCs) [1]. A particular aspect of contention addressed here is when two different connection requests arrive on a pair of adjacent XCs and they choose the same restoration channels from spare inventory. Such a contention problem is often referred to as “glare”. This paper gives channel selection methods that considerably reduce glare, while at the same time maintaining large groups of channels (for future high speed connections) across multiple, parallel links. We establish the benefit of our approach in a typical intercity backbone network. As shown in the simulation results, our channel selection mechanism can eliminate almost all the glare compared to the previously known algorithms, “Best-fit” and “Hi-Lo”. Index Terms – Channel selection algorithm, restoration, mesh restoration.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Throughput Path Selection Scheme for Multimedia Application in Wireless Networks

To discovery a high-throughput path for multimedia application, such as 3D stereoscopic application, in wireless mesh networks, existing route selection schemes only use a link quality metric based on the expected amount of medium time it takes to successfully transmit a packet. Thus, these schemes may easily result in network congestion. This is because the current status of traffic load is no...

متن کامل

QoS based Spectrum Selection Scheme in Cognitive Radio Networks

The demand for the wireless spectrum has been increased with the increase in usage of multimedia applications. The available spectrum can be efficiently used with the help of cognitive radio technology. In this paper, spectrum selection techniques in the case of cognitive radio networks are studied. Channel sharing and channel contention problems arise when multiple secondary users tend to sele...

متن کامل

Resource-Efficient Relay Selection in Cooperative Wireless Networks

This thesis focuses on cooperative relaying protocols employing a relay node that overhears data transmissions between a source and a destination nodes and retransmits the data when necessary. The achieved signal diversity at the destination improves the data recovery in fading-rich environments. While cooperative relay can improve communication on one link, the induced relay interference can d...

متن کامل

A flexible contention resolution scheme for QoS provisioning in optical burst switching networks

Contention resolution is a major issue in bufferless optical burst switching (OBS) networks. The existing contention resolution schemes consider priority and arrival time to resolve contention. For most multimedia applications priority and delay are key parameters for QoS provisioning. In this paper, we propose a new signaling protocol for reducing contention in OBS networks and consider three ...

متن کامل

Enhancing Contention Resolution ALOHA using Combining Techniques

Recently, random access protocols have acquired a new wave of interest, not only from the satellite communication community, but also from researchers active in fields like Internet of Things and machine-to-machine. Asynchronous (slotand frame-wise) ALOHA-like random access protocols, are very attractive for such applications, enabling low complexity transmitters and avoiding time synchronizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003